A Search Algorithm for Solving the Joint Replenishment Problem in a Distribution Center with Warehouse-space Restrictions
نویسنده
چکیده
This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts the warehouse-space restrictions in a distribution center. The focus of this study is to determine the lot sizes of each product under power-of-two policy to minimize the total costs per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space of the distribution center. To solve this problem, we propose a search algorithm to obtain the optimal replenishment cycle times of multiple products. Also, we devise a new heuristic to generate feasible replenishment schedules for the solutions obtained by the search algorithm. Based on our numerical experiments, we conclude that the proposed search algorithm could effectively solve the JRP with warehouse-space restrictions. KeywordsInventory, lot sizes, scheduling, search algorithm, warehouse, restrictions Corresponding author‟s email: [email protected] 1813-713X Copyright © 2010 ORSTW
منابع مشابه
Presenting a Joint Replenishment-location Model Under all-units Quantity Discount and Solving by Genetic Algorithm and Harmony Search Algorithm
In this paper a model is proposed for distribution centers location and joint replenishment of a distribution system that is responsible for orders and product delivery to distribution centers. This distribution centers are under limitedwarehouse space and this can determine amount of requirement product by considering proposed discount.The proposed model is develop to minimize total costs cons...
متن کاملSolving the Joint Replenishment Problem with Warehouse-space Restrictions Using a Genetic Algorithm
This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts warehouse-space restrictions. The focus of this study is to determine the lot size of each product under power-of-two policy to minimize the total cost per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space. In order to solve ...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملVendor Managed Inventory of a Single-vendor Multiple-retailer Single-warehouse Supply Chain under Stochastic Demands
In this study, a vendor-managed inventory model is developed for a single-vendor multiple-retailer single-warehouse (SV-MR-SV) supply chain problem based on the economic order quantity in which demands are stochastic and follow a uniform probability distribution. In order to reduce holding costs and to help balanced on-hand inventory cost between the vendor and the retailers, it is assumed that...
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کامل